On symmetric graphs of valency five
نویسندگان
چکیده
منابع مشابه
Symmetric Graphs of Valency
In this thesis we classify primitive amalgams of degree (5,2) and thereby obtain a description of symmetric graphs of valency 5. There are 22 such amalgams, and together with this list, we find the presentations for the universal completions of such amalgams and an example of a faithful finite completion in each case. Our methods include group theory, the amalgam method and some modular represe...
متن کاملSymmetric graphs of order 4p of valency prime
A graph is symmetric or arc-transitive if its automorphism group acts transitively on vertices, edges and arcs. Let p, q be odd primes with p, q ≥ 5 and X a q-valent symmetric graph of order 4p. In this paper, we proved that X K4p with 4p-1=q, X K2p,2p-2pK2 with 2p-1=q, the quotient graph of X is isomorphic to Kp,p and p=q, or K2p and 2p-1=q.
متن کاملClassifying pentavalnet symmetric graphs of order $24p$
A graph is said to be symmetric if its automorphism group is transitive on its arcs. A complete classification is given of pentavalent symmetric graphs of order 24p for each prime p. It is shown that a connected pentavalent symmetric graph of order 24p exists if and only if p=2, 3, 5, 11 or 17, and up to isomorphism, there are only eleven such graphs.
متن کاملHalf-Transitive Group Actions on Finite Graphs of Valency 4
The action of a subgroup G of automorphisms of a graph X is said to be 2 -transitive if it is vertexand edgebut not arc-transitive. In this case the graph X is said to be (G, 2)-transitive. In particular, X is 1 2 -transitive if it is (Aut X, 1 2)-transitive. The 2 -transitive action of G on X induces an orientation of the edges of X which is preserved by G. Let X have valency 4. An even length...
متن کاملFrobenius circulant graphs of valency four
A first kind Frobenius graph is a Cayley graph Cay(K,S) on the Frobenius kernel of a Frobenius group K o H such that S = a for some a ∈ K with 〈a〉 = K, where H is of even order or a is an involution. It is known that such graphs admit ‘perfect’ routing and gossiping schemes. A circulant graph is a Cayley graph on a cyclic group of order at least three. Since circulant graphs are widely used as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2010
ISSN: 0012-365X
DOI: 10.1016/j.disc.2009.11.019